A proof-theoretic analysis of the classical propositional matrix method
نویسندگان
چکیده
The matrix method, due to Bibel and Andrews, is a proof procedure designed for automated theorem-proving. We show that underlying this method is a fully structured combinatorial model of conventional classical proof theory.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملPropositional Logic Extended with a Pedagogically Useful Relevant
First and foremost, this paper concerns the combination of classical propositional logic with a relevant implication. The proposed combination is simple and transparent from a proof theoretic point of view and at the same time extremely useful for relating formal logic to natural language sentences. A specific system will be presented and studied, also from a semantic point of view. The last se...
متن کاملLPC(ID): A Sequent Calculus Proof System for Propositional Logic Extended with Inductive Definitions
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. Such logic formally extends logic programming, abductive logic programming and datalog, and thus formalizes the view on these formalisms as logics of (generalized) inductive definitions. The goal of this paper is to study a deductive inference method for PC(ID), w...
متن کاملA Classical Propositional Logic for Reasoning About Reversible Logic Circuits
We propose a syntactic representation of reversible logic circuits in their entirety, based on Feynman’s control interpretation of Toffoli’s reversible gate set. A pair of interacting proof calculi for reasoning about these circuits is presented, based on classical propositional logic and monoidal structure, and a natural order-theoretic structure is developed, demonstrated equivalent to Boolea...
متن کاملProofs and Countermodels in Non-Classical Logics
Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find one does not automatically give the other. The limitation is encountered also for decidable non-classical logics in traditional completeness proofs based on Henkin’s method of maximal consistent sets of formulas. A method is presented that makes it possible to establish completeness in a direct w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 24 شماره
صفحات -
تاریخ انتشار 2014